Multilevel Planarity
نویسندگان
چکیده
منابع مشابه
Ordered Level Planarity and Geodesic Planarity
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We show NP-completeness even for the spe...
متن کاملOrdered Level Planarity, Geodesic Planarity and Bi-Monotonicity
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We establish a complexity dichotomy with...
متن کاملToward a Theory of Planarity: Hanani-Tutte and Planarity Variants
We study Hanani-Tutte style theorems for various notions of planarity, including partially embedded planarity and simultaneous planarity. This approach brings together the combinatorial, computational and algebraic aspects of planarity notions and may serve as a uniform foundation for planarity, as suggested earlier in the writings of Tutte and Wu. Submitted: November 2012 Reviewed: March 2013 ...
متن کاملClustered Level Planarity
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs [6,10–16] and clustered graphs [5,7]. In k-level graphs, the vertices are partitioned into k levels and the vertices of one level are drawn on a horizontal line. I...
متن کاملPlanarity Testing Revisited
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by Allender and Mahajan [AM00] with the aid of Reingold’s result [Rei08]. Unfortunately, the algorithm is quite daunting and generalizing it to say, the bounded ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2021
ISSN: 1526-1719
DOI: 10.7155/jgaa.00554